home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- Path: hkusuc.hku.hk!hkusu10!h9300377
- From: h9300377@hkusu10.hku.hk (Chi-Ping)
- Subject: HELP -> GEOMETRY PROB.
- X-Nntp-Posting-Host: hkusu10.hku.hk
- Message-ID: <DL2EFI.GD1.0.-s@hkusuc.hku.hk>
- Sender: usenet@hkusuc.hku.hk
- Organization: The University of Hong Kong
- X-Newsreader: TIN [version 1.1 PL6]
- Date: Fri, 12 Jan 1996 10:57:18 GMT
-
- Dear all,
- Can anoyone solve the problem concerning the 2D polygon problem in
-
- writing my program.--- Slicing algorithm for Rapid Protyping.
-
- I need an algorithm to check the points and output as a simple closed
- polygon. The points are arbitary chosen.
-
-
-
- For examples, given the vertices shown : P1 * * P2
- * P3
-
- P5 * * P4
-
- P6 * * P8
- P7 *
-
-
- I have thought of checking the intersection between each lines
-
- (combinations) joined by the vertices but I don't know whether such
-
- algorithm work and don't exactly know how to start to write the syntax in
-
- C-prog.
-
- Should I think of " convex hull polgon "?
-
- Any experts can help me???
-
-
- Thanks in advance!
-
-
-
- ___________
- | Chi-Ping |____________________________________________________
- | Department of Industrial and Manufacturing Systems Engineering.
- | University of HongKong IMSE 3
- | h9300377@hkusub.hku.hk .
- ..............................................................
-
- ______________________________________________________________________________
-
-